When Online Learning Meets ODE: Learning without Forgetting on Variable Feature Space

نویسندگان

چکیده

Machine learning systems that built upon varying feature space are ubiquitous across the world. When set of practical or virtual features changes, online approach can adjust learned model accordingly rather than re-training from scratch and has been an attractive area research. Despite its importance, most studies for algorithms capable handling have no ensurance stationarity point convergence, while accuracy guaranteed methods still limited to some simple cases such as L_1 L_2 norms with square loss. To address this challenging problem, we develop efficient Dynamic Feature Learning System (DFLS) perform on unfixed more general statistical models demonstrate how DFLS opens up many new applications. We first achieve accurate & reliable feature-wise a broad class like logistic regression, spline interpolation, group Lasso Poisson regression. By utilizing DFLS, updated is theoretically same trained using entire space. Specifically, reparameterize feature-varying procedure devise corresponding ordinary differential equation (ODE) system compute optimal solutions status. Simulation reveal proposed substantially ease computational cost without forgetting.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Without Forgetting

When building a unified vision system or gradually adding new capabilities to a system, the usual assumption is that training data for all tasks is always available. However, as the number of tasks grows, storing and retraining on such data becomes infeasible. A new problem arises where we add new capabilities to a Convolutional Neural Network (CNN), but the training data for its existing capab...

متن کامل

When Semi-supervised Learning Meets Ensemble Learning

Semi-supervised learning and ensemble learning are two important machine learning paradigms. The former attempts to achieve strong generalization by exploiting unlabeled data; the latter attempts to achieve strong generalization by using multiple learners. Although both paradigms have achieved great success during the past decade, they were almost developed separately. In this paper, we advocat...

متن کامل

Clustering Based Feature Learning on Variable Stars

The success of automatic classification of variable stars strongly depends on the lightcurve representation. Usually, lightcurves are represented as a vector of many statistical descriptors designed by astronomers called features. These descriptors commonly demand significant computational power to calculate, require substantial research effort to develop and do not guarantee good performance o...

متن کامل

Investigating university students' views on online learning

Online learning is a concept that has received attention due to new technologies in the field of education; But today, due to the sudden spread of the corona virus, online learning has become common, so that most of the higher education institutions organize online learning courses. However, for many students, especially new undergraduate students who are used to the traditional learning enviro...

متن کامل

Online Learning Meets Optimization in the Dual

We describe a novel framework for the design and analysis of online learning algorithms. Our framework is based on a new perspective on relative mistake bounds by viewing the number of mistakes of an online learning algorithm as a lower bound for an optimization problem. This interpretation of a mistake bound draws a connection between online learning and optimization through the theory of dual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i7.26029